Approximating Spectral Invariants of Harper Operators on Graphs

نویسنده

  • STUART YATES
چکیده

We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada [Sun]. A main result in this paper is that the spectral density function of DMLs associated to rational weight functions on graphs with a free action of an amenable discrete group, can be approximated by the average spectral density function of the DMLs on a regular exhaustion, with either Dirichlet or Neumann boundary conditions. This then gives a criterion for the existence of gaps in the spectrum of the DML, as well as other interesting spectral properties of such DMLs. The technique used incorporates some results of algebraic number theory. Introduction Both the Harper operator and the discrete magnetic Laplacian (DML) on the Cayley graph of Z2 have been extremely well studied in mathematical physics, as they arise as the Hamiltonian for the discrete model describing the quantum mechanics of free electrons in the presence of a magnetic field. In particular, the DML is the Hamiltonian of the discrete model for the integer quantum Hall effect, cf. [Bel]. These operators can be easily generalized to the Cayley graph of an arbitrary discrete group. This and a further generalization to general graphs with a free co-compact action of a discrete group with finite quotient, was defined by Sunada [Sun] and studied in the context of noncommutative Bloch theory and the quantum Hall effect in [CHMM], [CHM], [MM], [MM2]. In this paper, we study certain aspects of the spectral theory of the DML on graphs X with a free group action with finite fundamental domain by a discrete amenable group Γ. We will use the following characterization of amenable groups, due to Følner (see also [Ad].) A discrete group Γ is said to be amenable if there is a sequence of finite subsets

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error bounds in approximating n-time differentiable functions of self-adjoint operators in Hilbert spaces via a Taylor's type expansion

On utilizing the spectral representation of selfadjoint operators in Hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in Hilbert Spaces via a Taylor's type expansion are given.

متن کامل

A ug 2 00 0 APPROXIMATING SPECTRAL INVARIANTS OF HARPER OPERATORS ON GRAPHS

We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada [Sun]. A main result in this paper is that the spectral density function of DMLs associated to rational weight functions on graphs with a free action of an amenable discrete group, can be approximated by the average spectral density functio...

متن کامل

L-spectral invariants and quasi-crystal graphs

Introducing and studying the pattern frequency algebra, we prove the analogue of Lück’s approximation theorems on L-spectral invariants in the case of aperiodic order. These results imply a uniform convergence theorem for the integrated density of states as well as the positivity of the logarithmic determinant of certain discrete Schrodinger operators. AMS Subject Classifications: 81Q10, 46L51

متن کامل

Splice Graphs and their Vertex-Degree-Based Invariants

Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

Applications of some Graph Operations in Computing some Invariants of Chemical Graphs

In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009